package com.wc.alorithm_luogu.P8786_李白打酒加强版;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 * @Author congege
 * @Description
 * @Date Created in 2024/2/4-21:13
 */
public class Main2 {
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 110;
    // f[i][j][k] 遇到 i 次 酒j次花 酒的状态为k
    static int[][][] f = new int[N][N][N];
    static int n, m;
    static int P = (int) 1e9 + 7;

    public static void main(String[] args) {
        f[0][0][2] = 1;
        n = sc.nextInt();
        m = sc.nextInt();
        for (int i = 0; i <= n; i++) {
            for (int j = 0; j <= m; j++) {
                for (int k = 0; k <= m; k++) {
                    if (j > 0) {
                        f[i][j][k] = (f[i][j][k] + f[i][j - 1][k + 1]) % P;
                    }
                    if (k % 2 == 0 && i > 0) {
                        f[i][j][k] = (f[i][j][k] + f[i - 1][j][k / 2]) % P;
                    }
                }
            }
        }
        out.println(f[n][m - 1][1]);
        out.flush();
    }

    static class FastReader {
        StringTokenizer st;
        BufferedReader br;

        FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String s = "";
            try {
                s = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return s;
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        boolean hasNext() {
            while (st == null || !st.hasMoreElements()) {
                String s = nextLine();
                if (s == null) {
                    return false;
                }
                st = new StringTokenizer(s);
            }

            return true;
        }
    }
}
